An Evaluation of CPU Efficiency Under Dynamic Quantum Allocation

DRAPE: Dynamic Resource Allocation for Power Efficiency

Evaluation of ESX Server Under CPU Intensive Workloads

We present a summary of our evaluation of VMWare ESX Server 2.5.2. In particular we confirm and work around known timing issues with guest operating systems running on ESX server. Our work validates and adds to the work of other groups modeling the behavior of ESX Server during CPU intensive workloads by exploring in more detail the effects of Hyper-Threading and the overhead of Virtual SMP. We...

An optimized round robin cpu scheduling algorithm with dynamic time quantum

CPU scheduling is one of the most crucial operations performed by operating system. Different algorithms are available for CPU scheduling amongst them RR (Round Robin) is considered as optimal in time shared environment. The effectiveness of Round Robin completely depends on the choice of time quantum. In this paper a new CPU scheduling algorithm has been proposed, named as DABRR (Dynamic Avera...

Building CPU Stubs to Optimize CPU Bound Systems: An Application of Dynamic Performance Stubs

Dynamic performance stubs provide a framework for the simulation of the performance behavior of software modules and functions. Hence, they can be used as an extension to software performance engineering methodologies. The methodology of dynamic performance stubs can be used for a gain oriented performance improvement. It is also possible to identify “hidden” bottlenecks and to prioritize optim...

Enforcing CPU allocation in a heterogeneous IaaS

In an Infrastructure as a Service (IaaS), the amount of resources allocated to a virtual machine (VM) at creation time may be expressed with relative values (relative to the hardware, i.e., a fraction of the capacity of a device) or absolute values (i.e., a performancemetric which is independent from the capacity of the hardware). Surprisingly, disk or network resource allocations are expressed...